Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment
نویسندگان
چکیده
Harry Buhrman, Matthias Christandl,* Patrick Hayden, Hoi-Kwong Lo, and Stephanie Wehner CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands DAMTP, University of Cambridge, Wilberforce Road, Cambridge, CB3 0WA, United Kingdom Arnold Sommerfeld Center for Theoretical Physics, Faculty of Physics, Ludwig-Maximilians-University Munich, Theresienstrasse 37, 80333 Munich, Germany School of Computer Science, McGill University, Montreal, Canada Department of ECE and Physics, University of Toronto, Canada M5G 3G4 California Institute of Technology, 1200 East California Boulevard, Pasadena California 91125, USA Received 8 November 2007; published 11 August 2008
منابع مشابه
Security bound of cheat sensitive quantum bit commitment
Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the s...
متن کاملSerial composition of quantum coin flipping and bounds on cheat detection for bit commitment
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in th...
متن کاملStronger impossibility results for quantum string commitment
String commitment schemes are similar to the well studied bit commitment schemes in cryptography with the difference that the committing party, say Alice is supposed to commit a long string instead of a single bit, to another party say Bob. Similar to bit commitment schemes, such schemes are supposed to be binding, i.e Alice cannot change her choice after committing and concealing i.e. Bob cann...
متن کاملUnconditionally Secure Quantum Bit Commitment Expansion
It is known that a quantum bit commitment that would be secure against all attacks allowed by quantum mechanics is impossible if a standard model of communication is used. This result was a severe step back for quantum cryptography. However, this impossibility result applies only if no bit commitment exists initially between Alice and Bob. Here we consider an initial situation in which the comm...
متن کاملOn the (Im)Possibility of Quantum String Commitment
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and quantum worlds. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? We consider quantum schemes where Alice commits a string of n bits to Bob, in such a way that she can only cheat on a bits and Bob can learn at most b bits of ”information” be...
متن کامل